A general formula for channel capacity
نویسندگان
چکیده
Abrlracr-A h u l a for the cppecity et arbitrary sbgle-wer chrurwla without feedback (mot neccgdueily Wium" stable, stationary, etc.) is proved. Capacity ie shown to e i p l the supremum, over all input processts, & the input-outpat infiqjknda QBnd as the llnainl ia praabiutJr d the normalized information density. The key to thir zbllljt is a ntw a"c sppmrh bosed 811 a Ampie II(A Lenar trwrd eu the pralwbility of m-4v hgpothesb t#tcl UIOlls eq*rdIaN <hypotheses. A neassruy and d c i e n t coadition Eor the validity of the strong comeme is given, as well as g"l expressions for eeapacity.
منابع مشابه
Information Theory Tutorial Communication over Channels with memory
A general capacity formula C = sup X I(X; Y), which is correct for arbitrary single-user channels without feedback, is introduced in this tutorial. This new capacity formula is obtained by using a general channel model without any assumptions of the channel, introducing the notion of inf/sup-information/entropy rates, and finding a new tight converse bound on the error probability. In Section 1...
متن کاملErgodic capacity of decode-and-forward relay strategies over general fast fading channels
Proposed is a novel ergodic capacity formula for decode-and-forward (DF) relaying over a very general fast fading channel model, i.e. the channel gains of the links follow independent but non-necessarily identically distributed Nakagami-m distributions. The proposed formula is validated by Monte Carlo simulations and can be computed efficiently. Since the considered channel model is very genera...
متن کاملInformation capacity formula of quantum optical channels
The applications of the general formulae of channel capacity developed in the quantum information theory to evaluation of information transmission capacity of optical channel are interesting subjects. In this review paper, we will point out that the formulation based on only classicalquantum channel mapping model may be inadequate when one takes into account a power constraint for noisy channel...
متن کاملA More General Version of the Costa Theorem
In accordance with the Costa theorem, the interference which is independent of the channel input and known non-causally at the transmitter, does not affect the capacity of the Gaussian channel. In some applications, the known interference depends on the input and hence has some information. In this paper, we study the channel with input dependent interference and prove a capacity theorem that n...
متن کاملCapacity of a memoryless quantum communication channel
We introduce a proper framework of coding problems for a quantum memoryless channel and derive an asymptotic formula for the channel capacity, based upon the philosophy that any information theory shall be constructed in terms of observable quantities. Some general lower and upper bounds for the quantum channel capacity are also derived.
متن کاملDistance-spectrum formulas on the largest minimum distance of block codes
A general formula for the asymptotic largest minimum distance (in block length) of deterministic block codes under generalized distance functions (not necessarily additive, symmetric, and bounded) is presented. As revealed in the formula, the largest minimum distance can be fully determined by the ultimate statistical characteristics of the normalized distance function evaluated under a properl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 40 شماره
صفحات -
تاریخ انتشار 1994